Improving Minimum Cost Spanning Trees by Upgrading Nodes
نویسندگان
چکیده
منابع مشابه
Improving Minimum Cost Spanning Trees by Upgrading Nodes
We study budget constrained network upgrading problems. We are given an undirected edge weighted graph G V E where node v V can be upgraded at a cost of c v . This upgrade reduces the weight of each edge incident on v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a minimum spanning tree of weight no more than a given budget D. The results obta...
متن کاملImproving Spanning Trees by Upgrading Nodes
Id: upgrade.tex,v 2.2 1997/09/18 13:14:08 krumke Exp wirth We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V;E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to nd a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The...
متن کاملUpdating Directed Minimum Cost Spanning Trees
We consider the problem of updating a directed minimum cost spanning tree (DMST), when edges are deleted from or inserted to a weighted directed graph. This problem apart from being a classic for directed graphs, is to the best of our knowledge a wide open aspect for the field of dynamic graph algorithms. Our contributions include results on the hardness of updates, a dynamic algorithm for upda...
متن کاملBalancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
The building cost of a spanning tree is the sum of weights of the edges used to construct the spanning tree. The routing cost of a source vertex s on a spanning tree T is the total summation of distances between the source vertex s and all the vertices d in T . Given a source vertices set S, the multiple-source routing cost of a spanning tree T is the summation of the routing costs for source v...
متن کاملGeometric Minimum Spanning Trees
Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1999
ISSN: 0196-6774
DOI: 10.1006/jagm.1999.1021